Thresholds Number 6: May 7 1993

NEOPA Conference- May 1993

NEOPA Conference- May 1993

PLS Newsletter, v3n8, May 1993

Washington University Record, October 7, 1993

Number 7

In Round-Robin Scheduling, the quantum time is static and tasks are scheduled such that no process uses CPU time more than one slice time each cycle. If quantum time is too large, the response time of the processes will not be tolerated in an interactive environment. If quantum the time is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer throughp...